Termination w.r.t. Q of the following Term Rewriting System could be proven:
Q restricted rewrite system:
The TRS R consists of the following rules:
a__f(X) → g(h(f(X)))
mark(f(X)) → a__f(mark(X))
mark(g(X)) → g(X)
mark(h(X)) → h(mark(X))
a__f(X) → f(X)
Q is empty.
↳ QTRS
↳ DirectTerminationProof
Q restricted rewrite system:
The TRS R consists of the following rules:
a__f(X) → g(h(f(X)))
mark(f(X)) → a__f(mark(X))
mark(g(X)) → g(X)
mark(h(X)) → h(mark(X))
a__f(X) → f(X)
Q is empty.
We use [23] with the following order to prove termination.
Lexicographic path order with status [19].
Quasi-Precedence:
mark1 > af1 > g1
mark1 > af1 > h1
mark1 > af1 > f1
Status: trivial